Core Stability in Hedonic Coalition Formation
نویسنده
چکیده
In many economic, social and political situations individuals carry out activities in groups (coalitions) rather than alone and on their own. Examples range from households and sport clubs to research networks, political parties and trade unions. The underlying game theoretic framework is known as coalition formation. This survey discusses the notion of core stability in hedonic coalition formation (where each player’s happiness only depends on the other members of his coalition but not on how the remaining players outside his coalition are grouped). We present the central concepts and algorithmic approaches in the area, provide many examples, and pose a number of open problems.
منابع مشابه
Hedonic coalition formation games: A new stability notion
This paper studies hedonic coalition formation games where each player’s preferences rely only upon the members of her coalition. A new stability notion under free exit-free entrymembership rights, referred to as strong Nash stability, is introducedwhich is stronger than both core and Nash stabilities studied earlier in the literature. Strong Nash stability has an analogue in non-cooperative ga...
متن کاملFractional Hedonic Games: Individual and Group Stability
Coalition formation provides a versatile framework for analyzing cooperative behavior in multi-agent systems. In particular, hedonic coalition formation has gained considerable attention in the literature. An interesting class of hedonic games recently introduced by Aziz et al. [3] are fractional hedonic games. In these games, the utility an agent assigns to a coalition is his average valuation...
متن کاملShao-chin Sung; Dinko Dimitrov: Computational Complexity in Additive Hedonic Games Computational Complexity in Additive Hedonic Games *
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. ...
متن کاملComputational complexity in additive hedonic games
The opinions expressed in this paper do not necessarily reflect the position of Summary We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration...
متن کاملShao-Chin Sung und Dinko Dimitrov: Computational Complexity in Additive Hedonic Games
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. ...
متن کامل